Flexible multichannel blind deconvolution, an investigation
نویسندگان
چکیده
In this paper, we consider the issue of devising a flexible nonlinear function for multichannel blind deconvolution. In particular, we consider the underlying assumption of the source probability density functions. We consider two cases, when the source probability density functions are assumed to be uni-modal, and multimodal respectively. In the unimodal case, there are two approaches: Pearson function and generalized exponential function. In the multimodal case, there are three approaches: mixture of Gaussian functions, mixture of Pearson functions, and mixture of generalized exponential functions. It is demonstrated through an illustrating example that the assumption on the source probability density functions gives rise to different performances of source separation algorithms for the multichannel blind deconvolution problem. Further it is observed that these performance differences are not large, indicating that the current formulation of multichannel blind deconvolution problems is robust with respect to the underlying assumption of source probability density functions. It is further speculated that one of the discriminating features among various source separation algorithms appears to be the relative computational efficiencies of various approximation schemes. In other words, the discriminating feature of various source separation algorithms based on assumptions on the source probability density function appears to be an implementation issue rather than one of a theoretical concern.
منابع مشابه
Super-exponential methods for multichannel blind deconvolution
Multichannel blind deconvolution has received increasing attention during the last decade. Recently, Martone [3, 4] extended the super-exponential method proposed by Shalvi and Weinstein [1, 2] for single-channel blind deconvolution to multichannel blind deconvolution. However, the Martone extension suffers from two type of serious drawbacks. The objective of this paper is to obviate these draw...
متن کاملMultichannel Blind Deconvolution of the Short-Exposure Astronomical Images
In this paper we present a new multichannel blind deconvolution method based on so-called subspace technique that was originally proposed by Harikumar and Bresler. When at least two differently degraded images (channels) of the original scene are provided, the method is better conditioned than classical single channel ones. In comparison with earlier multichannel blind deconvolution techniques ...
متن کاملMultichannel data: separating independent causes
The algorithm for blind deconvolution of a nonstationary time series of vector components (i.e. multichannel) has three stages: (1) Linear-least-squares multichannel prediction-error filtering, (2) Cholesky factorization of the zero-lag covariance matrix, and (3) Rotation angle scanning for maximum sparsity.
متن کاملFrequency-domain Implementation of Block Adaptive Filters for Ica-based Multichannel Blind Deconvolution
In this paper, we present frequency-domain implementations of two adaptive multichannel blind deconvolution filters that employ the independent component analysis principle. The proposed implementations achieve considerable computational gains, which is shown by performing detailed analysis on the computational complexity. Particularly, our implementations incorporate a nonholonomic constraint ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003